#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int a[N],n;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    queue<int>que;
    int k=0;
    while(k<n){
        k++;
        if(!que.empty()&&a[k]>que.front()){
            que.pop();
            que.push(a[k]);
        }
        else que.push(a[k]);
    }
    cout<<que.size()<<endl;
    return 0;
}
